منابع مشابه
Skew cyclic codes of arbitrary length
In this paper we study a special type of linear codes, called skew cyclic codes, in the most general case. This set of codes is a generalization of cyclic codes but constructed using a non-commutative ring called the skew polynomial ring. In previous works these codes have been studied with certain restrictions on their length. This work examines their structure for an arbitrary length without ...
متن کاملSkew Cyclic and Quasi-Cyclic Codes of Arbitrary Length over Galois Rings
We mainly investigate the structures of skew cyclic and skew quasicyclic codes of arbitrary length over Galois rings. Similar to [5], our results show that the skew cyclic codes are equivalent to either cyclic and quasi-cyclic codes over Galois rings. Moreover, we give a necessary and sufficient condition for skew cyclic codes over Galois rings to be free. A sufficient condition for 1-generator...
متن کاملSkew Generalized Quasi-cyclic Codes
This article discusses skew generalized quasi-cyclic codes over any finite field F with Galois automorphism θ. This is a generalization of quasi-cyclic codes and skew polynomial codes. These codes have an added advantage over quasi-cyclic codes since their lengths do not have to be multiples of the index. After a brief description of the skew polynomial ring F[x; θ], we show that a skew general...
متن کاملOn Skew Cyclic Codes over a Finite Ring
In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.
متن کاملOn Z2Z4[\xi]-Skew Cyclic Codes
Z2Z4-additive codes have been defined as a subgroup of Z r 2 ×Z s 4 in [5] where Z2, Z4 are the rings of integers modulo 2 and 4 respectively and r and s positive integers. In this study, we define a new family of codes over the set Zr2[ξ̄] × Z s 4[ξ] where ξ is the root of a monic basic primitive polynomial in Z4[x]. We give the standard form of the generator and parity-check matrices of codes ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Information and Coding Theory
سال: 2011
ISSN: 1753-7703,1753-7711
DOI: 10.1504/ijicot.2011.044674